Golay Codes
نویسنده
چکیده
We discuss a specific type of error-control coding using Golay codes. First we introduce the basics of coding. Then we discuss the Golay code in binary form, extended binary form, and ternary form.
منابع مشابه
Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملTitle Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملA p-Adic View of the Algebraic Decoding of Lifted Golay Codes
The perfect Golay codes lifted over the finite rings Z2m and Z3m, or over their infinite counterparts, namely the 2-adic and 3-adic rings, are considered, and their algebraic decoding is obtained as a non-trivial extension of the algebraic decoding of the perfect Golay codes. Mathematics Subject Classification: 94B15, 94B35, 11D88, 14G50
متن کاملOn Construction of the (24,12,8) Golay Codes
—Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8, 4, 4) linear block component codes for generating the Golay code, and it generates and extends previously existing methods that use a similar construction framework. The code constructed is simple to decode.
متن کاملOn non-antipodal binary completely regular codes
Binary non-antipodal completely regular codes are characterized. Using the result on nonexistence of nontrivial binary perfect codes, it is concluded that there are no unknown nontrivial non-antipodal completely regular binary codes with minimum distance d ≥ 3. The only such codes are halves and punctered halves of known binary perfect codes. Thus, new such codes with covering radiuses ρ = 2, 3...
متن کامل